A timed Petri net framework to find optimal IRIS schedules
نویسنده
چکیده
Abstract: IRIS (increasing reward with increasing service) realtime scheduling appears frequently in real-time control applications such as heuristic control. IRIS requires not only meeting deadlines, but also finding the schedule with the best result (highest reward). In this paper, a framework is presented that uses Timed Petri nets (TPN) to transform an IRIS problem into a dynamic programming (DP) problem, allowing the application of known TPN and DP techniques. In the presented approach, an IRIS problem with tasks having discrete-time optimal parts is transformed into a (possibly unbounded) TPN. Then, the critical path problem of the TPN state graph can be tackled with DP. This approach allows for the IRIS problem multiple constraints and negative rewards.
منابع مشابه
Optimal Schedules of Manufacturing Cells — Modeling and Analysis Using Timed Petri Nets
A method for systematic generation of simple and composite schedules for a large class of manufacturing cells is presented. The generated schedules can easily be transformed into timed Petri net models, and these models evaluated using one of methods developed for analysis of timed Petri nets, for example, invariant analysis. Performance characterization (the cycle time or the throughput) obtai...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملModeling Simple Schedules of Manufacturing Cells Using Timed Petri Nets
It is shown that a large class of flexible manufacturing cells can be modeled using timed Petri nets. Net models of simple schedules (i.e., schedules in which exactly one part enter and one leaves the cell during each cycle) are conflict–free nets. Invariant analysis of such models provides analytic (or symbolic) solutions for the cycle time or throughput of a cell. Several directions for furth...
متن کاملTime Management Approach on a Discrete Event Manufacturing System Modeled by Petri Net
Discrete event system, Supervisory control, Petri Net, Constraint This paper presents a method to manage the time in a manufacturing system for obtaining an optimized model. The system in this paper is modeled by the timed Petri net and the optimization is performed based on the structural properties of Petri nets. In a system there are some states which are called forbidden states an...
متن کاملTimed Petri Net Models of Flexible Manufacturing Cells
It is shown that a class of flexible manufacturing cells can be conveniently modeled and evaluated by timed Petri nets. For simple schedules, the modeling nets are covered by conflict–free invariant subnets, so the performance of the model is determined by the performance of its subnets. For composite schedules, the invariant subnets are free-choice, so a more elaborate approach to evaluating t...
متن کامل